On the Descriptional Complexity of Limited Propagating Lindenmayer Systems
نویسنده
چکیده
We investigate the descriptional complexity of limited propagating Lindenmayer systems and their deterministic and tabled variants with respect to the number of rules and the number of symbols. We determine the decrease of complexity when the generative capacity is increased. For incomparable families, we give languages that can be described more efficiently in either of these families than in the other.
منابع مشابه
Sequential Versus Parallel Grammar Formalisms with Respect to Measures of Descriptional Complexity
For tabled Lindenmayer systems and their languages, the degree of synchronization and the degree of nondeterminism are well investigated measures of descriptional complexity. In this paper the sequential counterparts of tabled Lindenmayer systems, namely cooperating distributed grammar systems and their pure variant (working in the so called t-mode of derivation) are treated with respect to the...
متن کاملDescriptional Complexity of Machines with Limited Resources
Over the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of different contexts, our goal here is to provide a survey of these results. Particular emphasis is put on limiting resources (e.g., nondeterminism, ambiguity, lookahead, etc.) for various types of finite state machines, push...
متن کاملAccepting Grammars and Systems
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly limited Lindenmayer systems, limited Lindenmayer systems and scattered context grammars) as accepting devices, in contrast with the usual generating mode. In some cases, accepting mode turns out to be j...
متن کاملLimited IL Systems
In this paper, the limitation process of k-limited and uniformly k-limited 0L systems is transferred to IL systems, that is to Lindenmayer systems with interaction. For non-extended systems, according to the different limitations of the systems, we get incomparability results of the corresponding language families. According to the number of left and right neighbours which a cell (symbol) is al...
متن کاملThe Formal Language Theory Column
Formal languages can be described by several means. A basic question is how succinctly can a descriptional system represent a formal language in comparison with other descriptional systems? What is the maximal size trade-off when changing from one system to another, and can it be achieved? Here, we select some recent trends in the descriptional complexity of formal languages and discuss the pro...
متن کامل